A Topologically Convex Vertex-Ununfoldable Polyhedron

نویسندگان

  • Zachary Abel
  • Erik D. Demaine
  • Martin L. Demaine
چکیده

We construct a polyhedron that is topologically convex (i.e., has the graph of a convex polyhedron) yet has no vertex unfolding: no matter how we cut along the edges and keep faces attached at vertices to form a connected (hinged) surface, the surface necessarily unfolds with overlap.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

3 A ug 1 99 9 Ununfoldable Polyhedra

A well-studied problem is that of unfolding a convex polyhedron into a simple planar polygon. In this paper, we study the limits of unfoldability. We give an example of a polyhedron with convex faces that cannot be unfolded by cutting along its edges. We further show that such a polyhedron can indeed be unfolded if cuts are allowed to cross faces. Finally, we prove that “open” polyhedra with co...

متن کامل

Ununfoldable polyhedra

A well-studied problem is that of unfolding a convex polyhedron into a simple planar polygon. In this paper, we study the limits of unfoldability. We give an example of a polyhedron with convex faces that cannot be unfolded by cutting along its edges. We further show that such a polyhedron can indeed be unfolded if cuts are allowed to cross faces. Finally, we prove that \open" polyhedra with co...

متن کامل

Ununfoldable polyhedra with convex faces

Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the same combinatorial structure as convex polyhedra. In particular, we give two examples of polyhedra, one with 24 convex faces and one with 36 triangular faces, that cannot be unfolded by cutting along edges. We further ...

متن کامل

Zipper Unfolding of Domes and Prismoids

We study Hamiltonian unfolding—cutting a convex polyhedron along a Hamiltonian path of edges to unfold it without overlap—of two classes of polyhedra. Such unfoldings could be implemented by a single zipper, so they are also known as zipper edge unfoldings. First we consider domes, which are simple convex polyhedra. We find a family of domes whose graphs are Hamiltonian, yet any Hamiltonian unf...

متن کامل

Zipper Unfoldability of Domes and Prismoids

We study Hamiltonian unfolding—cutting a convex polyhedron along a Hamiltonian path of edges to unfold it without overlap—of two classes of polyhedra. Such unfoldings could be implemented by a single zipper, so they are also known as zipper edge unfoldings. First we consider domes, which are simple convex polyhedra. We find a family of domes whose graphs are Hamiltonian, yet any Hamiltonian unf...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011